Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers

نویسندگان

  • Lubomíra Balková
  • Edita Pelantová
  • Ondrej Turek
چکیده

We study arithmetical and combinatorial properties of β-integers for β being the root of the equation x = mx − n,m, n ∈ N,m ≥ n + 2 ≥ 3. We determine with the accuracy of ±1 the maximal number of β-fractional positions, which may arise as a result of addition of two β-integers. For the infinite word uβ coding distances between consecutive β-integers, we determine precisely also the balance. The word uβ is the fixed point of the morphism A → AB and B → AB. In the case n = 1 the corresponding infinite word uβ is sturmian and therefore 1-balanced. On the simplest non-sturmian example with n ≥ 2, we illustrate how closely the balance and arithmetical properties of β-integers are related.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Palindromic complexity of infinite words associated with non-simple Parry numbers

We study the palindromic complexity of infinite words uβ , the fixed points of the substitution over a binary alphabet, φ(0) = 01, φ(1) = 01, with a − 1 ≥ b ≥ 1, which are canonically associated with quadratic non-simple Parry numbers β. 1991 Mathematics Subject Classification. 68R15, 11A63 .

متن کامل

Abelian complexity of infinite words associated with quadratic Parry numbers

We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers. © 2011 Elsevier B.V. All rights reserved.

متن کامل

Factor complexity of infinite words associated with non-simple Parry numbers

The factor complexity of the infinite word uβ canonically associated to a non-simple Parry number β is studied. Our approach is based on the notion of special factors introduced by Berstel and Cassaigne. At first, we give a handy method for determining infinite left special branches; this method is applicable to a broad class of infinite words which are fixed points of a primitive substitution....

متن کامل

Infinite Special Branches in Words Associated with Beta-Expansions

A Parry number is a real number β > 1 such that the Rényi β-expansion of 1 is finite or infinite eventually periodic. If this expansion is finite, β is said to be a simple Parry number. Remind that any Pisot number is a Parry number. In a previous work we have determined the complexity of the fixed point uβ of the canonical substitution associated with β-expansions, when β is a simple Parry num...

متن کامل

Palindromic complexity of infinite words associated with simple Parry numbers

A simple Parry number is a real number β > 1 such that the Rényi expansion of 1 is finite, of the form dβ(1) = t1 · · · tm. We study the palindromic structure of infinite aperiodic words uβ that are the fixed point of a substitution associated with a simple Parry number β. It is shown that the word uβ contains infinitely many palindromes if and only if t1 = t2 = · · · = tm−1 ≥ tm. Numbers β sat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ITA

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2007